Ideal Cognition

Ideal Multilinear Maps based on Ideal Lattices

Cryptographic multilinear maps have many applications, such as multipartite key exchange and software obfuscation. However, the encodings of three current constructions are “noisy” and their multilinearity levels are fixed and bounded in advance. In this paper, we describe a candidate construction of ideal multilinear maps by using ideal lattices, which supports arbitrary multilinearity levels....

Ideal Multilinear Maps Based on Ideal Lattices

Cryptographic multilinear maps have many applications, such as multipartite key exchange and software obfuscation. However, the encodings of three current constructions are “noisy” and their multilinearity levels are fixed and bounded in advance. In this paper, we describe a candidate construction of ideal multilinear maps by using ideal lattices, which supports arbitrary multilinearity levels....

IDEAL J *-ALGEBRAS

A C *-algebra A is called an ideal C * -algebra (or equally a dual algebra) if it is an ideal in its bidual A**. M.C.F. Berglund proved that subalgebras and quotients of ideal C*-algebras are also ideal C*-algebras, that a commutative C *-algebra A is an ideal C *-algebra if and only if it is isomorphicto C (Q) for some discrete space ?. We investigate ideal J*-algebras and show that the a...

Ideal Interpolation

A linear interpolation scheme is termed ‘ideal’ when its errors form a polynomial ideal. The paper surveys basic facts about ideal interpolation and raises some questions. Ideal interpolation is, by definition, given by a linear projector on the space Π of polynomials whose kernel is a polynomial ideal. It is therefore also any linear map, as used in algebra, that associates a polynomial with i...

Ideal Marriage